Visibility Preprocessing for Urban Scenes using Line Space Subdivision

نویسندگان

  • Jirí Bittner
  • Peter Wonka
  • Michael Wimmer
چکیده

We present an algorithm for visibility preprocessing of urban environments. The algorithm uses a subdivision of line space to analytically calculate a conservative potentially visible set for a given region in the scene. We present a detailed evaluation of our method including a comparison to another recently published visibility preprocessing algorithm. To the best of our knowledge the proposed method is the first algorithm that scales to large scenes and efficiently handles large view cells.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Techniques for Visibility Computations

Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a 3D scene. Nowadays there is a plethora of visibility algorithms for various applications. The thesis proposes a taxonomy of visibility problems based on the dimension of the problem-relevant line set, i.e. set o...

متن کامل

Conservative Visibility Determination for Architectural Scenes

In this article I present a conservative visibility determination algorithm, particularly suited for interactive walkthroughs in architectural scenes. This algorithm is able to determine which parts of the scene are visible during an interactive real-time walkthrough. The algorithm consists of an off-line part, which preprocesses the scene, and an on-line part, which determines the potentially ...

متن کامل

Visibility Preprocessing for Complex 3d Scenes Using Hardware-visibility Queries

In cases of densely occluded urban scenes, it is effective to determine the visibility of scenes, since only small parts of the scene are visible from a given cell. In this paper, we introduce a new visibility preprocessing method that efficiently computes potentially visible objects for volumetric cells. The proposed method deals with general 3D polygonal models and invisible objects jointly b...

متن کامل

Conservative Visibility Preprocessing for Complex Virtual Environments

This paper presents a new approach to visibility culling. We propose a conservative visibility preprocessing method for complex virtual environments. The proposed method deals with general 3D graphical models and invisible polygons jointly blocked by multiple occluders. The proposed method decomposes volume visibility from the predefined volume into the area visibility from rectangles surroundi...

متن کامل

Ray Space Factorization for From-Region Visibility

We present a fast conservative from-region visibility method capable of handling 3D models using arbitrary 3D triangles as occluders. The from-region visibility problem is considered significantly harder than the from-point visibility problem, since it is inherently 4-dimensional. Our occlusion culling method is based on factorizing the 4D visibility problem into horizontal and vertical compone...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001